package demo.practice.competition;

public class P1893 {


    public boolean isCovered(int[][] ranges, int left, int right) {
        for(int i=left;i<=right;i++){
            boolean fg= false;
            for (int[] range : ranges) {
                if(i>= range[0]&& i<= range[1] ){
                    //覆盖
                    fg=true;
                    break;
                }
            }
            if(!fg)
                return false;
        }
        return true;
    }


}
